منابع مشابه
Proof Theory of a Multi-Lane Spatial Logic
We extend the Multi-lane Spatial Logic MLSL, introduced in previous work for proving the safety (collision freedom) of traffic maneuvers on a multi-lane highway, by length measurement and dynamic modalities. We investigate the proof theory of this extension, called EMLSL. To this end, we prove the undecidability of EMLSL but nevertheless present a sound proof system which allows for reasoning a...
متن کاملA pr 2 01 5 PROOF THEORY OF A MULTI - LANE SPATIAL LOGIC
We extend the Multi-lane Spatial Logic MLSL, introduced in previous work for proving the safety (collision freedom) of traffic maneuvers on a multi-lane highway, by length measurement and dynamic modalities. We investigate the proof theory of this extension, called EMLSL. To this end, we prove the undecidability of EMLSL but nevertheless present a sound proof system which allows for reasoning a...
متن کاملUndecidability Results for Multi-Lane Spatial Logic
We consider (un)decidability of Multi-Lane Spatial Logic (MLSL), a multi-dimensional modal logic introduced for reasoning about traffic manoeuvres. MLSL with length measurement has been shown to be undecidable. However, the proof relies on exact values. This raises the question whether the logic remains undecidable when we consider robust satisfiability, i.e. when values are known only approxim...
متن کاملA Simpler Proof Theory for Nominal Logic
Nominal logic is a variant of first-order logic which provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values considered so far). Previous attempts have been made to develop convenient rules for reasoning with the new-quantifier, but we argue that none of these...
متن کاملA Proof Theory for Constructive Default Logic
We present what we call Constructive Default Logic (CDL) a default logic in which the fixedpoint definition of extensions is replaced by a constructive definition which yield so-called constructive extensions. Selection functions are used to represent explicitly the control of the reasoning process in this default logic. It is well-known that Reiter's original default logic lacks, in general, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2015
ISSN: 1860-5974
DOI: 10.2168/lmcs-11(3:4)2015